Games and Definability for System F
نویسنده
چکیده
We present a game-theoretic model of the polymorphic λ-calculus, system F , as a fibred category. Every morphism σ of the model defines an η-expanded, β-normal form σ̂ of system F whose interpretation is σ. Thus the model gives a precise, non-syntactic account of the calculus.
منابع مشابه
Games and definability for FPC
A new games model of the language FPC, a type theory with products, sums, function spaces and recursive types, is described. A definability result is proved, showing that every finite element of the model is the interpretation of some term of the language. §
متن کاملMaximal elements of $mathscr{F}_{C,theta}$-majorized mappings and applications to generalized games
In the paper, some new existence theorems of maximal elements for $mathscr{F}_{C,theta}$-mappings and $mathscr{F}_{C,theta}$-majorized mappings are established. As applications, some new existence theorems of equilibrium points for one-person games, qualitative games and generalized games are obtained. Our results unify and generalize most known results in recent literature.
متن کاملDynamic system of strategic games
Maybe an event can't be modeled completely through one game but there is more chance with several games. With emphasis on players' rationality, we present new properties of strategic games, which result in production of other games. Here, a new attitude to modeling will be presented in game theory as dynamic system of strategic games and its some applications such as analysis of the clash betwe...
متن کاملPolarized Games
We generalize the intuitionistic Hyland–Ong games (and in a second step Abramsky–Jagadeesan– Malacaria games) to a notion of polarized games allowing games with plays starting by proponent moves. The usual constructions on games are adjusted to fit this setting yielding game models for both Intuitionistic Linear Logic and Polarized Linear Logic. We prove a definability result for this polarized...
متن کاملOnce Upon a Time in the West Determinacy, definability, and complexity of path games⋆
We study determinacy, definability and complexity issues of path games on finite and infinite graphs. Compared to the usual format of infinite games on graphs (such as GaleStewart games) we consider here a different variant where the players select in each move a path of arbitrary finite length, rather than just an edge. The outcome of a play is an infinite path, the winning condition hence is ...
متن کامل